A O(|V|·|E|) algorithm for maximum matching of graphs
نویسندگان
چکیده
منابع مشابه
A scaling algorithm for maximum weight matching in bipartite graphs
Given a weighted bipartite graph, the maximum weight matching (MWM) problem is to find a set of vertex-disjoint edges with maximum weight. We present a new scaling algorithm that runs in O(m √ n logN) time, when the weights are integers within the range of [0, N ]. The result improves the previous bounds of O(Nm √ n) by Gabow and O(m √ n log (nN)) by Gabow and Tarjan over 20 years ago. Our impr...
متن کاملLinear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs
Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph problems. For general m-edge and n-vertex graphs, it is well-known to be solvable in O(m √ n) time. We develop the first linear-time algorithm to find maximumcardinality matchings on cocomparability graphs, a prominent subclass of perfect graphs that contains interval graphs as well as permutati...
متن کاملMaximum matching on random graphs
– The maximum matching problem on random graphs is studied analytically by the cavity method of statistical physics. When the average vertex degree c is larger than 2.7183, groups of max-matching patterns which differ greatly from each other gradually emerge. An analytical expression for the max-matching size is also obtained, which agrees well with computer simulations. Discussion is made on t...
متن کاملA simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs
In this paper, we consider the problem of finding a maximum weight 2-matching containing no cycle of length at most three in a weighted simple graph, which we call the weighted trianglefree 2-matching problem. Although the polynomial solvability of this problem is still open in general graphs, a polynomial-time algorithm is given by Hartvigsen and Li for the problem in subcubic graphs, i.e., gr...
متن کاملA Novel Symbolic Algorithm for Maximum Weighted Matching in Bipartite Graphs
The maximum weighted matching problem in bipartite graphs is one of the classic combinatorial optimization problems, and arises in many different applications. Ordered binary decision diagram (OBDD) or algebraic decision diagram (ADD) or variants thereof provides canonical forms to represent and manipulate Boolean functions and pseudo-Boolean functions efficiently. ADD and OBDD-based symbolic a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computing
سال: 1974
ISSN: 0010-485X,1436-5057
DOI: 10.1007/bf02239502